Kite systems of order 8; embedding of kite systems into bowtie systems
نویسندگان
چکیده
This article consist of two parts. In the first part, we enumerate the kite systems of order 8; in the second part, we consider embedding kite systems into bowtie systems.
منابع مشابه
Embedding path designs into kite systems
Let D be the triangle with an attached edge (i. e. D is the “kite”, a graph having vertices {a0, a1, a2, a3} and edges {a0, a1}, {a0, a2}, {a1, a2}, {a0, a3}). Bermond and Schönheim [6] proved that a kite-design of order n exists if and only if n ≡ 0 or 1 (mod 8). Let (W, C) be a nontrivial kite-design of order n ≥ 8, and let V ⊂ W with |V | = v < n. A path design (V,P) of order v and block siz...
متن کاملKite-designs intersecting in pairwise disjoint blocks
A kite-design of order n is a decomposition of the complete graph Kn into kites. Such systems exist precisely when n ≡ 0, 1 (mod 8). Two kite systems (X,K1) and (X,K2) are said to intersect in m pairwise disjoint blocks if |K1∩K2| = m and all blocks in K1∩K2 are pairwise disjoint. In this paper we determine all the possible values of m such that there are two kite-designs of order n intersectin...
متن کاملOctagon Quadrangle Systems nesting 4-kite-designs having equi-indices
An octagon quadrangle is the graph consisting of an 8-cycle (x1, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v and index λ [OQS] is a pair (X,B), where X is a finite set of v vertices and B is a collection of edge disjoint octagon quadrangles (called blocks) which partition the edge set of λKv defined on X. A 4-kite is the graph ha...
متن کاملAIP JRSE Submission Analysis of the Maximum Efficiency of Kite-Power Systems
This paper analyzes the maximum power that a kite, or system of kites, can extract from the wind. Firstly, a number of existing results on kite system efficiency are reviewed. The results that are generally applicable require significant simplifying assumptions, usually neglecting the effects of inertia and gravity. On the other hand, the more precise analyses are usually only applicable to a p...
متن کاملH-Decompositions of r-graphs when H is an r-graph with exactly 2 edges
Given two r-graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. The minimum number of parts in an H-decomposition of G is denoted by φH(G). By a 2-edge-decomposition of an r-graph we mean an H-decomposition for any fixed r-graph H with exactly 2 edges. In the special case where the two edges of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 67 شماره
صفحات -
تاریخ انتشار 2017